Index structuring in inverted data bases by TRIES

Incremental structuring of knowledge bases

An important structuring mechanism for knowledge bases is building an inheritance hierarchy of classes based on the content of their knowledge objects. The hierarchy can be used to handle several query processing tasks more efficiently. Building and maintaining this hierarchy is a difficult task for the knowledge engineer. The notion of knowledge space has been previously proposed to help autom...

Automatic Structuring of Knowledge Bases by Conceptual Clustering

Inverted Index Compression

The data structure at the core of nowadays large-scale search engines, social networks and storage architectures is the inverted index, which can be regarded as being a collection of sorted integer sequences called inverted lists. Because of the many documents indexed by search engines and stringent performance requirements dictated by the heavy load of user queries, the inverted lists often st...

I Inverted Index Compression

The data structure at the core of nowadays largescale search engines, social networks, and storage architectures is the inverted index. Given a collection of documents, consider for each distinct term t appearing in the collection the integer sequence `t , listing in sorted order all the identifiers of the documents (docIDs in the following) in which the term appears. The sequence `t is called ...

Dynamic Inverted Index Maintenance

The majority of today’s IR systems base the IR task on two main processes: indexing and searching. There exists a special group of dynamic IR systems where both processes (indexing and searching) happen simultaneously; such a system discards obsolete information, simultaneously dealing with the insertion of new information, while still answering user queries. In these dynamic, time critical tex...